Log space machines with multiple oracle tapes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Log Space Machines with Multiple Oracle Tapes

As an alternative to previously studied models for space-bounded relative computation, an oracle Turing machine with a space bound on its worktape and an arbitrary number of oracle tapes is considered. Basic properties of the resulting reducibilities are examined.

متن کامل

The Log Space Oracle Hierarchy Collapses DRAFT

The polynomial time hierarchy of Meyer and Stockmeyer has several equivalent characterizations — in particular it can be defined either in terms of polynomial time oracle Turing machines [Sto76], or in terms of polynomial time alternating Turing machines where the number of alternations is finitely bounded [CKS81]. One of the most important open questions in the area is whether or not this hier...

متن کامل

Coevolution of Machines and Tapes

A problem of self-referential paradox and self-reproduction is discussed in a network model of machines and tapes. A tape consists of a bit string, encoding function of a machine. Tapes are replicated when it is attached by an adequate machine. Generally, a tape is replicated but it may be di erent from the original one. In this paper, external noise evolves diversity in a system. New reaction ...

متن کامل

Tangled Tapes: Infinity, Interaction and Turing Machines

In the sixty-five years since Turing introduced his eponymous machines, many popular misconceptions about their properties have become current. In this paper, we explore the notions that Turing machines have infinite tapes and that their expressive power is limited by by an inability to interact with the wider environment during computations.

متن کامل

Oracle Turing machines faced with the verification problem

The main current issue about hypercomputation concern the following thesis: it is physically possible to build a hypercomputation model. To prove this thesis, one possible strategy could be to physically build an oracle Turing machine. More precisely, it is about finding a physical theory where a hypercomputation model will be able to use some external information from nature. Such an informati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1978

ISSN: 0304-3975

DOI: 10.1016/0304-3975(78)90003-8